منابع مشابه
Burgess bounds for short mixed character sums
This paper proves nontrivial bounds for short mixed character sums by introducing estimates for Vinogradov’s mean value theorem into a version of the Burgess method.
متن کاملElementary bounds on character sums with polynomial arguments
Again, for small degrees d, this is the kind of cancellation that we would expect from a sum of q random points on the unit circle. Looking at the whole argument in totality, what we just did is highly highly dependent on P (X) being a single monomial. The multiplicativity of the monomial brings the characters of the multiplicative group into play. For a general polynomial P (X), we have no suc...
متن کاملUpper Bounds on Character Sums with Rational Function Entries
We obtain formulae and estimates for character sums of the type S(χ, f, pm) = ∑pm x=1 χ(f(x)), where p m is a prime power with m ≥ 2, χ is a multiplicative character (mod pm), and f = f1/f2 is a rational function over Z. In particular, if p is odd, d = deg(f1) + deg(f2) and d∗ = max(deg(f1), deg(f2)) then we obtain |S(χ, f, pm)| ≤ (d− 1)pm(1− 1 d∗ ) for any non constant f (mod p) and primitive ...
متن کاملLower Bounds For Multidimensional Zero Sums
Let f(n,d) denote the least integer such that any choice of f(n,d) elements in Zdn contains a subset of size n whose sum is zero. Harborth proved that (n− 1)2 + 1 ≤ f(n,d) ≤ (n−1)n+1. The upper bound was improved by Alon and Dubiner to cd n. It is known that f(n,1)=2n−1 and Reiher proved that f(n,2)=4n−3. Only for n=3 it was known that f(n,d)> (n−1)2+1, so that it seemed possible that for a fix...
متن کاملCell-Probe Lower Bounds for Prefix Sums
We prove that to store n bits x ∈ {0, 1}n so that each prefix sum (a.k.a. rank) query Sum(i) := ∑ k≤i xk can be answered by non-adaptively probing q cells of lg n bits, one needs memory n + n/ log n. This matches a recent upper bound of n+ n/ log n by Pǎtraşcu (FOCS 2008), also non-adaptive. We also obtain a n + n/ log O(q) n lower bound for storing a string of balanced brackets so that each Ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Mathematics Research Notices
سال: 2011
ISSN: 1687-0247,1073-7928
DOI: 10.1093/imrn/rnr219